When is it better not to look ahead?

نویسندگان

  • Dana S. Nau
  • Mitja Lustrek
  • Austin Parker
  • Ivan Bratko
  • Matjaz Gams
چکیده

In situations where one needs to make a sequence of decisions, it is often believed that looking ahead will help produce better decisions. However, it was shown 30 years ago that there are “pathological” situations in which looking ahead is counterproductive. Two long-standing open questions are (a) what combinations of factors have the biggest influence on whether lookahead pathology occurs, and (b) whether it occurs in real-world decision-making. This paper includes simulation results for several synthetic game-tree models, and experimental results for three well-known board games: two chess endgames, kalah (with some modifications to facilitate experimentation), and the 8-puzzle. The simulations show the interplay between lookahead pathology and several factors that affect it; and the experiments confirm the trends predicted by the simulation models. The experiments also show that lookahead pathology is more common than has been thought: all three games contain situations where it occurs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accelerating Decoupled Look-ahead via Weak Dependence Removal: A Metaheuristic Approach – Technical Report∗

Despite the proliferation of multi-core and multi-threaded architectures, exploiting implicit parallelism for a single semantic thread is still a crucial component in achieving high performance. Look-ahead is a tried-and-true strategy in uncovering implicit parallelism, but a conventional, monolithic out-of-order core quickly becomes resource-inefficient when looking beyond a small distance. A ...

متن کامل

Effect of look-ahead search depth in learning position evaluation functions for Othello using epsilon-greedy exploration

This paper studies the effect of varying the depth of look-ahead for heuristic search in temporal difference (TD) learning and game playing. The acquisition position evaluation functions for the game of Othello is studied. The paper provides important insights into the strengths and weaknesses of using different search depths during learning when 2-greedy exploration is applied. The main findin...

متن کامل

Fuel Optimal Powertrain Control for Heavy Trucks Utilizing Look Ahead

The road topography in highways affects the powertrain control of a heavy truck substantially since the engine power is low in relation to the vehicle weight. In large road gradients constant speed is not possible to keep, which would have been beneficial otherwise, and in some uphills shifting gears becomes inevitable. If information about the road ahead, i.e. look ahead information, is availa...

متن کامل

Accelerating Decoupled Look-ahead to Exploit Implicit Parallelism

Despite the proliferation of multi-core and multi-threaded architectures, exploiting implicit parallelism for a single semantic thread is still a crucial component in achieving high performance. While a canonical out-of-order engine can effectively uncover implicit parallelism in sequential programs, its effectiveness is often hindered by instruction and data supply imperfections (manifested as...

متن کامل

Diagnosis and Repair Iteration Planning versus N-Step Look Ahead Planning

In this paper we compare the performance of planning algorithms distinguishing and iterating between observation (diagnosis) and repair (action) phases with algorithms extending conventional planning methods with observations using n-step look ahead. Diagnosis and repair iteration planning algorithms are an extension of earlier work of Friedrich and Nejdl, n-step look ahead planning including d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Artif. Intell.

دوره 174  شماره 

صفحات  -

تاریخ انتشار 2010